Using Relaxations in Maximum Density Still Life
نویسندگان
چکیده
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of Life. We reformulate the problem into one of minimising “wastage” rather than maximising the number of live cells. This reformulation allows us to compute strong upper bounds on the number of live cells. By combining this reformulation with several relaxation techniques, as well as exploiting symmetries via caching, we are able to find close to optimal solutions up to size n = 100, and optimal solutions for instances as large as n = 69. The best previous method could only find optimal solutions up to n = 20.
منابع مشابه
A complete solution to the Maximum Density Still Life Problem
The Maximum Density Still Life Problem (CSPLib prob032) is to find the maximum number of live cells that can fit in an n × n region of an infinite board, so that the board is stable under the rules of Conway’s Game of Life. It is considered a very difficult problem and has a raw search space of O(2 2 ). Previous state of the art methods could only solve up to n = 20. We give a powerful reformul...
متن کاملRelaxations of methylpyridinone tautomers at the C60 surfaces: DFT studies
Density functional theory (DFT) based calculations have been performed to examine the relaxations of tautomers of 4–hydroxy–6–methylpyridin–2(1H)–one (MPO), as a representative of pyridinone derivatives, at the fullerene (C60) surfaces. Optimized molecular properties including energies, dipole moments and atomic scale quadrupole coupling constants (CQ) have been e...
متن کاملRelaxations of methylpyridinone tautomers at the C60 surfaces: DFT studies
Density functional theory (DFT) based calculations have been performed to examine the relaxations of tautomers of 4–hydroxy–6–methylpyridin–2(1H)–one (MPO), as a representative of pyridinone derivatives, at the fullerene (C60) surfaces. Optimized molecular properties including energies, dipole moments and atomic scale quadrupole coupling constants (CQ) have been e...
متن کاملConstraint Programming to Solve Maximal Density Still Life
The Maximum Density Still Life problem fills a finite Game of Life board with a stable pattern of cells that has as many live cells as possible. Although simple to state, this problem is computationally challenging for any but the smallest sizes of board. Especially difficult is to prove that the maximum number of live cells has been found. Various approaches have been employed. The most succes...
متن کاملImproving Combinatorial Optimization - Extended Abstract
Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In the thesis [Chu, 2011], we present important contributions to several different areas of combinatorial optimization, including nogood learning, symmetry breaking, dominance, relaxations and parallelization. We develop a new nogood learning technique based on constraint pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009